Monochromatic bounded degree subgraph partitions
نویسندگان
چکیده
منابع مشابه
Monochromatic bounded degree subgraph partitions
Let F = {F1, F2, . . .} be a sequence of graphs such that Fn is a graph on n vertices with maximum degree at most ∆. We show that there exists an absolute constant C such that the vertices of any 2-edge-colored complete graph can be partitioned into at most 2C∆log ∆ vertex disjoint monochromatic copies of graphs from F . If each Fn is bipartite, then we can improve this bound to 2C∆; this resul...
متن کاملDegree-bounded vertex partitions
This paper studies degree-bounded vertex partitions, considers analogues for wellknown results on the chromatic number and graph perfection, and presents two algorithms for constructing degree-bounded vertex partitions. The first algorithm minimizes the number of partition classes. The second algorithm minimizes a weighted sum of the partition classes where the weight of a partition class depen...
متن کاملJudicious partitions of bounded-degree graphs
We prove results on partitioning graphs G with bounded maximum degree. In particular, we provide optimal bounds for bipartitions V (G) = V1 ∪ V2 in which we minimize max{e(V1), e(V2)}.
متن کاملThe Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh
The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree ∆ and the diameter D, was introduced in [1], as a generalization of the Degree-Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a k-dimensional mesh. We provide s...
متن کاملThe Maximum Degree & Diameter-Bounded Subgraph and its Applications
We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host graph), subject to constraints on the maximum degree and the diameter. We discuss some applications in security, network design and parallel processing, and in connection with the latter we derive some bounds for the order of the largest subgraph in host graphs of practical interest: the mesh and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.07.005